Reducing round-off errors in symmetric multistep methods
نویسندگان
چکیده
Certain symmetric linear multistep methods have an excellent long-time behavior when applied to second order Hamiltonian systems with or without constraints. For high accuracy computations round-off can be the dominating source of errors. This article shows how symmetric multistep methods should be implemented, so that round-off errors are minimized and propagate like a random walk.
منابع مشابه
A multistep flux-corrected transport scheme
A multistep flux-corrected transport (MFCT) scheme is developed to achieve conservative and monotonic tracer transports for multistep dynamical cores. MFCT extends Zalesak twotime level scheme to any multistep time-differencing schemes by including multiple highorder fluxes in the antidiffusive flux, while computing the two-time level low-order monotone solution. The multistep time-differencing...
متن کاملReducing round-off errors in rigid body dynamics
In several recent publications, numerical integrators based on Jacobi elliptic functions are proposed for solving the equations of motion of the rigid body. Although this approach yields theoretically the exact solution, a standard implementation shows an unexpected linear propagation of round-off errors. We explain how deterministic error contribution can be avoided, so that round-off behaves ...
متن کاملAn L-curve for the MINRES method
A variant of the MINRES method, often referred to as the MR-II method, has in the last few years become a popular iterative scheme for computing approximate solutions of large linear discrete ill-posed problems with a symmetric matrix. It is important to terminate the iterations sufficiently early in order to avoid severe amplification of measurement and round-off errors. We present a new L-cur...
متن کاملThe Numerical Integration of Ordinary Differential Equationst
Multistep methods for initial value problems are expressed in a matrix form. The application of such methods to higher-order equations is studied with the result that new techniques for both firstand higher-order equations are found. The direct approach to higher-order equations is believed to offer speed and accuracy advantages; some numerical evidence is presented. The new technique applied t...
متن کاملComputation of Eigenvalues and Eigenvectors for the Discrete Ordinate and Matrix Operator Methods in Radiative Transfer
Nakajima and Tanaka showed that the algebraic eigenvalue problem occurring in the discrete ordinate and matrix operator methods can be reduced to finding eigenvalues and eigenvectors of the product of two symmetric matrices, one of which is positive definite. Here, we show that the Cholesky decomposition of this positive definite matrix can be used to convert the eigenvalue problem into one inv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 262 شماره
صفحات -
تاریخ انتشار 2014